具有某种断面的半群的研究进展

本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后，概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面，纯正断面，正则^*－断面和恰当断面。提出了可以进一步研究的重要的问题。     

关于半群局部化的一个注记

证明了对于任何的半群Ｓ和其任何的子半群Ｔ，Ｓ在Ｔ的局部化总是存在的。     

一类逆半群的亚直可约性

本文利用逆半群上的同余扩张，讨论了一类逆半群的亚直可约性，并刻划了这类逆半群的幂等元集的特征。     

SOME SUBGROUPS OF THE EXTENDED HECKE GROUPS (λ_q)

The authors consider the extended Hecke groups H(λq) generated by T(z) = -1 / z, S(z) = -1/(z + λq,) and R(z) = 1 / z with A, = 2 cos(π/q) for q≥3 an integer. In this paper, the even subgroup He(λq), the second commutator subgroup H (λq) and the principal congruence subgroups Hp(λq) of the extended Hecke groups H(λq) are studied. Also, relations between them are given.     

Stone代数的Cayley表示定理

首先通过集代数得到了Stone代数的表示定理,然后证明了每一个Stone代数均嵌入到某个集合X上的一个Stone映射类S中.     

R~(2,1)中线性Weingarten曲面的Bcklund变换(英文)

本文对三维Minkowski空间R~(2,1)中具有性质K-2mH+m~2-l~2=0或H=constant的类时曲面定义了一个Darboux线汇,同时得到了相应的Bcklund变换。     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

On tolerance lattices of algebras in congruence modular varieties

We prove that the tolerance lattice TolA of an algebra A from a congruence modular variety V is 0-1 modular and satisfies the general disjointness property. If V is congruence distributive, then the lattice Tol A is pseudocomplemented. If V admits a majority term, then Tol A is 0-modular. This revised version was published online in June 2006 with corrections to the Cover Date.